package com.ayuer.chapter05;

import java.util.PriorityQueue;

public class DataFlowFindKthLargest {

    public static void main(String[] args) {
        //升序
        PriorityQueue<Integer> priorityQueue = new PriorityQueue<>((a, b) -> a - b);
        PriorityQueue<Integer> priorityQueue2 = new PriorityQueue<>((a, b) -> b - a);
    }
}
